Effective Search Strategies for Application-Independent Speedup in UDP Demultiplexing
نویسندگان
چکیده
We present UDP datagram demultiplexing techniques that can yield potentially substantial applicationindependent performance gains over BSD-derived UDP implementations. Our demultiplexing strategies exploit local host and UDP implementation features -(1) how UDP processes connection-less datagrams, (2) local host application as client or server, and (3) local host application “density” -resulting in straight-forward hash-based search strategies that caused demultiplexing speedups as high as 24-to-1 over BSD’s one-behind cache. Furthermore, while past researchers have shown that cache-based schemes yield little performance benefit for UDP, we show that cache-based implementations can actually degrade demultiplexing performance. Finally, we recommend simple, non-protocol altering local host modifications for existing and future UDP implementations. We used four server traffic traces and eight algorithms in our trace-driven simulations, and executed more than 60 simulations to obtain our results.
منابع مشابه
Evaluating the Performance of Demultiplexing Strategies for Real-time CORBA
Efficient and predictable demultiplexing is necessary to provide real-time support for distributed object computing applications developed with CORBA. This paper presents two contributions to the study of demultiplexing for real-time CORBA endsystems. First, we present an empirical study of three demultiplexing strategies used by a real-time Object Adapter based on SunSoft IIOP. These strategie...
متن کاملImplementing TreadMarks over GM on Myrinet: Challenges, Design Experience, and Performance Evaluation
Software based DSM systems like TreadMarks have traditionally not performed well compared to message passing applications because of the high overhead of communication associated with traditional stack based protocols like UDP. Modern interconnects like Myrinet offer reliable message delivery with very low communication overhead through user level protocols. This paper examines the viability of...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملParallel Strategies for Grasp with Path-relinking
A Greedy Randomized Adaptive Search Procedure (GRASP) is a metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and local search. Path-relinking is an intensification strategy that explores trajectories that connect high quality solutions. We analyze two parallel strategies for GRASP with path-relinking and propose ...
متن کامل